A Technique for Proving Lower Bounds on the Size of Sweeping Automata
نویسنده
چکیده
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. Sipser [12] has proved that one-way nondeterministic finite automata can be exponentially more succinct in sizes than sweeping automata. In this paper, we propose a technique based on the work in [6] for establishing lower bounds on the size of sweeping automata. We show that Sipser’s technique is a special case of our method. In addition, we prove two lower bound results with the new technique.
منابع مشابه
ETH Library Infinite vs. Finite Size-Bounded Randomized Computations
Randomized computations can be very powerful with respect to space complexity, e. g., for logarithmic space, LasVegas is equivalent to nondeterminism. This power depends on the possibility of infinite computations, however, it is an open question if they are necessary. We answer this question for rotating finite automata (rfas) and sweeping finite automata (sfas). We show that LasVegas rfas (sf...
متن کاملImproved Upper and Lower Bounds for Büchi Disambiguation
We present a new ranking based construction for disambiguating non-deterministic Büchi automata and show that the state complexity tradeoff of the translation is in O(n · (0.76n)). This exponentially improves the best upper bound (i.e., 4 · (3n)) known earlier for Büchi disambiguation. We also show that the state complexity tradeoff of translating non-deterministic Büchi automata to strongly un...
متن کاملA Characterisation of NL/poly via Nondeterministic Finite Automata
For each language L ⊆ 2 and non-zero monotonic function t ∶ N → N, we define a language t∗L ⊆ 2 depending only on L and t. We then prove that a language L lies in NL/poly if and only if there exists a polynomially bounded t (as above), such that the projections (t ∗L) ∩ 2 are accepted by nondeterministic finite automata of size polynomial in n. Therefore, proving super-polynomial lower bounds f...
متن کاملTight Lower Bounds on the Size of Sweeping Automata
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. We say that a sweeping automaton is degenerate if the automaton has no left-moving transitions. We show that for each positive integer n, there is a nondeterministic finite automaton An over a two-letter alphabet such that An has n states, whereas the smallest equivalent nondegenerate swee...
متن کاملMatrix Rank in Communication Complexity
This lecture focuses on proving communication lower bounds using matrix rank. Similar to fooling sets and rectangle size bounds, the matrix rank technique also gives a lower bound on the number of monochromatic rectangles in any partition of X × Y but it does so in an algebraic way[1]. This makes algebraic tools available for proving communication lower bounds. We begin by solving the problem a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 14 شماره
صفحات -
تاریخ انتشار 2009